A Constraint - Based Region

نویسنده

  • InferenceAlgorithmLars Birkedal
چکیده

Region inference is a type-based technique for determining runtime memory management at compile time. It is targeted at a runtime model in which the store consists of a stack of regions and memory management predominantly consists of pushing and popping regions. Region inference has previously been speciied by a set of inference rules, which formalize when regions may be allocated and deallo-cated. We present a constraint-based algorithm which implements the speciication. It consists of a constraint-based formulation of region inference and a rewriting algorithm for solving a set of constraints. We prove that the constraint-based formulation of region inference is sound with respect to the region inference rules. Moreover we prove \restricted completeness" of the constraint-based formulation, that is, we deene an \implementation-oriented" formulation of region inference and show that every derivation in the implementation-oriented formulation can be obtained by a solution to a corresponding constraint problem. We show that rewriting of a constraint problem always terminates with a solution to the original system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Free and constrained equilibrium states in a variational problem on a surface

We study the equilibrium states for an energy functional with a parametric force field on a region of a surface. Consideration of free equilibrium states is based on Lyusternik - Schnirelman's and Skrypnik's variational methods. Consideration of equilibrium states under a constraint of geometrical character is based on an analog of Skrypnik's method, described in [P. Vyridis, {it Bifurcation in...

متن کامل

A Chance Constraint Approach to Multi Response Optimization Based on a Network Data Envelopment Analysis

In this paper, a novel approach for multi response optimization is presented. In the proposed approach, response variables in treatments combination occur with a certain probability. Moreover, we assume that each treatment has a network style. Because of the probabilistic nature of treatment combination, the proposed approach can compute the efficiency of each treatment under the desirable reli...

متن کامل

A Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

متن کامل

OPTIMAL DESIGN OF STEEL MOMENT FRAME STRUCTURES USING THE GA-BASED REDUCED SEARCH SPACE (GA-RSS) TECHNIQUE

This paper proposes a GA-based reduced search space technique (GA-RSS) for the optimal design of steel moment frames. It tries to reduce the computation time by focusing the search around the boundaries of the constraints, using a ranking-based constraint handling to enhance the efficiency of the algorithm. This attempt to reduce the search space is due to the fact that in most optimization pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999